Computing almost minimal formulas on the square
نویسندگان
چکیده
The main purpose of this paper is to introduce a numerical method for the computation of cubature rules in the square [−1, 1]2 that are almost minimal, i.e. with few points w.r.t. the degree of precision d. In particular for all 24 ≤ d ≤ 55 the sets ξd and the weights {wk} are new. New rules are also achieved for degrees 15, d = 17, 19 and d = 23 respectively with 43, 54, 67 and 96 points.
منابع مشابه
Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملComputing Vertex PI Index of Tetrathiafulvalene Dendrimers
General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.
متن کاملIntegral formulas for the minimal representation of O(p, 2)
The minimal representation π of O(p, q) (p + q: even) is realized on the Hilbert space of square integrable functions on the conical subvariety of Rp+q−2. This model presents a close resemblance of the Schrödinger model of the Segal-Shale-Weil representation of the metaplectic group. We shall give explicit integral formulas for the ‘inversion’ together with the analytic continuation to a certai...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملEigenvectors and minimal bases for some families of Fiedler-like linearizations
In this paper we obtain formulas for the left and right eigenvectors and minimal bases of some families of Fiedler-like linearizations of square matrix polynomials. In particular, for the families of Fiedler pencils, generalized Fiedler pencils, and Fiedler pencils with repetition. These formulas allow us to relate the eigenvectors and minimal bases of the linearizations with the ones of the po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2012